A* search algorithm

Results: 648



#Item
41Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2011-05-18 09:50:44
42Semi-Automated Debugging via Binary Search through a Process Lifetime Kapil Arya ∗ Tyler Denniston∗

Semi-Automated Debugging via Binary Search through a Process Lifetime Kapil Arya ∗ Tyler Denniston∗

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2013-10-18 20:51:40
43Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Add to Reading List

Source URL: webdb2004.cs.columbia.edu

Language: English - Date: 2004-05-31 19:36:24
44Analysis with parallel partition 11 —  We know a pack is O(n) work, O(log n) span ¡  Based

Analysis with parallel partition 11 —  We know a pack is O(n) work, O(log n) span ¡  Based

Add to Reading List

Source URL: twiki.di.uniroma1.it

Language: English - Date: 2015-10-28 09:23:18
45Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich

Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:27
46Similarity Search: A Matching Based Approach Anthony K. H. Tung† Rui Zhang‡  Nick Koudas§

Similarity Search: A Matching Based Approach Anthony K. H. Tung† Rui Zhang‡ Nick Koudas§

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2006-08-13 18:27:24
47C:/Mina dokument/4th year project/ProjectReport.dvi

C:/Mina dokument/4th year project/ProjectReport.dvi

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Language: English - Date: 2007-02-02 09:38:01
48Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary

Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary

Add to Reading List

Source URL: ggp.stanford.edu

Language: English - Date: 2009-04-20 18:54:11
49This talk is divided into 7 parts. Part 1 begins with a quick look at the SSA optimization framework and global value numbering. Part 2 describes a well known brute force algorithm for GVN. Part 3 modifies this to arriv

This talk is divided into 7 parts. Part 1 begins with a quick look at the SSA optimization framework and global value numbering. Part 2 describes a well known brute force algorithm for GVN. Part 3 modifies this to arriv

Add to Reading List

Source URL: www.sable.mcgill.ca

Language: English - Date: 2009-03-09 09:18:56
50Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke  Albert-Ludwigs-Universit¨at Freiburg

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ad-publications.informatik.uni-freiburg.de

Language: English - Date: 2013-04-29 10:40:39